منابع مشابه
Criterions for locally dense subgraphs
Community detection is one of the most investigated problems in the field of complex networks. Although several methods were proposed, there is still no precise definition of communities. As a step towards a definition, I highlight two necessary properties of communities, separation and internal cohesion, the latter being a new concept. I propose a local method of community detection based on t...
متن کاملFinding Dense Subgraphs
In this paper we establish that the Lovász θ function on a graph can be restated as a kernel learning problem. We introduce the notion of SVM−θ graphs, on which Lovász θ function can be approximated well by a Support vector machine (SVM). We show that Erdös-Rényi random G(n, p) graphs are SVM−θ graphs for log4 n n ≤ p< 1. Even if we embed a large clique of size Θ (√ np 1−p ) in a G(n, p) graph ...
متن کاملOn Finding Dense Subgraphs
Given an undirected graph G = (V,E), the density of a subgraph on vertex set S is defined as d(S) = |E(S)| |S| , where E(S) is the set of edges in the subgraph induced by nodes in S. Finding subgraphs of maximum density is a very well studied problem. One can also generalize this notion to directed graphs. For a directed graph one notion of density given by Kannan and Vinay is as follows: given...
متن کاملIsolation concepts for efficiently enumerating dense subgraphs
In an undirected graph G = (V,E), a set of k vertices is called c-isolated if it has less than c · k outgoing edges. Ito and Iwama [ACM Trans. Algorithms, to appear] gave an algorithm to enumerate all c-isolated maximal cliques in O(4c · c4 · |E|) time. We extend this to enumerating all maximal c-isolated cliques (which are a superset) and improve the running time bound to O(2.89c ·c2 · |E|), u...
متن کاملFast Hierarchy Construction for Dense Subgraphs
Discovering dense subgraphs and understanding the relations among them is a fundamental problem in graph mining. We want to not only identify dense subgraphs, but also build a hierarchy among them (e.g., larger but sparser subgraphs formed by two smaller dense subgraphs). Peeling algorithms (k-core, k-truss, and nucleus decomposition) have been effective to locate many dense subgraphs. However,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2012
ISSN: 0378-4371
DOI: 10.1016/j.physa.2011.09.040